搜索资源列表
NGC_ACM
- 图割（GC)和主动轮廓模型（ACM)相结合的一种图像分割方法，既可以进行局部图像的分割，也可进行全局图像的分割，简单实用。-A combination of graph cuts (GC) and the active contour model (ACM) image segmentation method, either local image segmentation, global image segmentation, simple and practical.
grabcut
- grabcut程序,基于文章：grabcut-interactive foreground extraction using ierated graph cuts-grabcut program based on :grabcut-interactive foreground extraction using ierated graph cuts
demoBiasedNcut.tar
- 图割算法的一种，NCut， normalized Cut。在聚类分析时，比一般基于图割方法更有效。-A graph cut algorithm, NCut, normalized Cut. Cluster analysis method based on graph cuts than the general more effective.
graphcut
- 使用QT4開發的影像切割應用程式 基於Graph cuts來運算 可執行在Linux、XP、MAC上,並有多種模式(GMD, NN, ANN) -A GUI and batch capable software for easy and versatile image segmentation. Graph cuts are used for segmentation with several models (GMD, NN, ANN) available. The appli
GridCut-1.1
- Cache-efficient graph cuts on structured grids
MRF
- MRF 用于SAR图像的目标分割，里面有BP-S，Graph cuts，trw-s等算法c程序。-MRF target for SAR image segmentation, which BP-S, Graph cuts, trw-s algorithm c program.
superpixels1pt1
- 带有图分割的超像素分割软件，是用C++开发的源码，供大家学习-software for superpixel segmentation with graph cuts Version 1.1
MIA_final_code
- nteractive Segmentation using Graph Cuts CS 578 Medical Image Analysis Final Project Report
program
- 背景建模和graph cuts相结合的方法对图像进行分割，达到了良好的效果。-a method which combines the background model and graph cuts achieve the good performance
ExtractBackground
- he files in this package comprise the Matlab implementation of a foreground segmentation algorithm based upon graph cuts, described in: Better Foreground Segmentation Through Graph Cuts, N. Howe & A. Deschamps. Tech report, http://arxiv.org/
Data-Clustering-with-Normalized-Cuts
- Data clustering using graph cut method
GRAPH_CUT_STEREO_AA
- 全局立体匹配一直是一个比较困难的问题，本算法通过C++编译器，实现了全局立体匹配算法，希望对你有帮助-Stereo matching algorithm based on graph cuts, using the maximum flow/minimum cut methods to achieve global stereo matching.
grabcut
- GRABCUTOpenCV中的GrabCut算法是依据《"GrabCut" - Interactive Foreground Extraction using Iterated Graph Cuts》这篇文章来实现的。该算法利用了图像中的纹理（颜色）信息和边界（反差）信息，只要少量的用户交互操作即可得到比较好的分割结果。如果前景和背景之间的颜色反差不大，分割的效果不好；不过，这种情况下允许手工标记一些前景或背景区域，这样能得到较好的结果。-GRABCUTOpenCV in GrabCut alg
Graph-Cuts
- 马尔可夫随机场的图像分割，本人整理的代码和论文-Markov random field image segmentation, I am finishing the code and papers
active-graph-cuts
- 这是对最大流/最小割算法的改进方法的文献，希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard
MRF1.6
- This directory contains the MRF energy minimization software accompanying the paper [1] A Comparative Study of Energy Minimization Methods for Markov Random Fields. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarw
BVZ-pami01-final
- 通过图割的快速近似能量最小化。图像分割：最小割最大-Fast Approximate Energy Minimization via Graph Cuts
GraphSegment
- opengl 图论分割，基于openGL框架的图论分割，分割效果依赖于阈值设定-graph cuts based on opengl
MergeMeshSrc
- 一个新的合并方法，多重网格（在一个共同的坐标）在一个单一的拓扑正确的网。这种方法是基于约束Delaunay四面体化和图割优化-a new merging method of multiple meshes (in a common coordinate) into one single topologically correct mesh. This method is based on the constrained Delaunay tetrahedralization and graph
Interactive-Image-Segmentation
- 交互式图像分割，是根据Yuri Boykov and Marie-Pierre Jolly的文章，用C++和OpenCV实现的-Automatic image segmentation is a hard problem and, is not flexible enough to be used for general segmentation. The objective of this project is to implement an interactive image segment